-
1 provable formula
graphic formula — структурная формула, формула строения
The English-Russian dictionary general scientific > provable formula
-
2 provable formula
Большой англо-русский и русско-английский словарь > provable formula
-
3 provable formula
-
4 provable formula
Математика: доказуемая формула -
5 provable formula
доказуемая формулаEnglish-Russian dictionary of technical terms > provable formula
-
6 provable formula
мат. -
7 arithmetically provable formula
Математика: арифметически доказуемая формулаУниверсальный англо-русский словарь > arithmetically provable formula
-
8 geometrically provable formula
Математика: геометрически доказуемая формулаУниверсальный англо-русский словарь > geometrically provable formula
-
9 arithmetically provable formula
English-Russian scientific dictionary > arithmetically provable formula
-
10 geometrically provable formula
English-Russian scientific dictionary > geometrically provable formula
-
11 provable
матем. доказуемый arithmetically provable formula ≈ арифметически доказуемая формула formally provable theorem ≈ лог. формально доказуемая теорема geometrically provable formula ≈ геометрически доказуемая формула - arithmetically provable - formally provable - geometrically provable - intuitionistically provable - provable definability - provable equation - provable formula - provable sentence - provable sequent - provable statement доказуемый provable доказуемыйБольшой англо-русский и русско-английский словарь > provable
-
12 formula
1) рецепт2) формула || формульный3) формулировка•- arithmetically valid formula - back interpolation formula - computational formula - computing formula - corrector formula - formally decidable formula - formally refutable formula - formula of finite increments - geometrically valid formula - homomorphically stable formula - identically false formula - identically true formula - intuitionistically valid formula - logically valid formula - maximum likelihood formula - modally valid formula - monotonically increasing formula - numeralwise expressible formula - numeralwise representable formula - positively valid formula - primitively recursive formula - reciprocity formula - secondarily valid formula - square stable formula - universally valid formulato follow the formula — подчиняться [следовать] формуле; описываться формулой
-
13 formula
1) формула
2) формульный
3) рецепт
4) формулировка
– addition formula
– assumption formula
– atomic formula
– basic formula
– binomial formula
– by formula
– chain formula
– closed formula
– compatible formula
– corollary formula
– corrector formula
– derivation of formula
– derive formula
– design formula
– dimensional formula
– duplication formula
– empirical formula
– exact formula
– five-term formula
– formula feed
– Fresnel's formula
– Gauss formula
– Griem's formula
– half-angle formula
– horse-power formula
– interpolation formula
– inversion formula
– Khintchine-Pollaczek formula
– molecular formula
– prenex formula
– prime formula
– prismoidal formula
– provable formula
– quadratic formula
– recurrence formula
– recursion formula
– reverse formula
– starter formula
– summation formula
Hardy-Weinberg equilibrium formula — <phys.> закон Харди-Вейнберга
Newton's interpolation formula — интерполяционная формула Ньютона
-
14 provable
-
15 provable
a доказуемыйСинонимический ряд:demonstrable (adj.) checkable; demonstrable; determinable; examinable; testable; triable -
16 доказуемая формула
Большой англо-русский и русско-английский словарь > доказуемая формула
-
17 arithmetically
арифметически arithmetically consistent data ≈ арифметически непротиворечивые данные arithmetically definable set ≈ арифметически определимое множество arithmetically defined subgroup ≈ арифметически определенная подгруппа arithmetically equivalent degree ≈ арифметически эквивалентная степень arithmetically expressible sentence ≈ арифметически выразимое высказывание arithmetically extensible function ≈ арифметически продолжаемая функция arithmetically normal variety ≈ арифметически нормальное многообразие arithmetically provable formula ≈ арифметически доказуемая формула arithmetically valid formula ≈ арифметически общезначимая формула completely arithmetically productive set ≈ вполне арифметически продуктивное множество - arithmetically connected - arithmetically definable - arithmetically equivalent - arithmetically extensible - arithmetically provable - arithmetically validарифметическиБольшой англо-русский и русско-английский словарь > arithmetically
См. также в других словарях:
Baker-Campbell-Hausdorff formula — In mathematics, the Baker Campbell Hausdorff formula is the solution to:Z = log(e^X e^Y),for non commuting X and Y . It is named for Henry Frederick Baker, John Edward Campbell, and Felix Hausdorff. It was first noted in print by Campbell,… … Wikipedia
Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… … Wikipedia
Proof of impossibility — A proof of impossibility, sometimes called a negative proof or negative result , is a proof demonstrating that a particular problem cannot be solved, or cannot be solved in general. Often proofs of impossibility have put to rest decades or… … Wikipedia
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Heyting algebra — In mathematics, Heyting algebras are special partially ordered sets that constitute a generalization of Boolean algebras, named after Arend Heyting. Heyting algebras arise as models of intuitionistic logic, a logic in which the law of excluded… … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
propositional calculus — Logic. See sentential calculus. [1900 05] * * * Formal system of propositions and their logical relationships. As opposed to the predicate calculus, the propositional calculus employs simple, unanalyzed propositions rather than predicates as its… … Universalium
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia
Rosser's trick — For the theorem about the sparseness of prime numbers, see Rosser s theorem. For a general introduction to the incompleteness theorems, see Gödel s incompleteness theorems. In mathematical logic, Rosser s trick is a method for proving Gödel s… … Wikipedia